P-positions in modular extensions to Nim

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winning Positions in Simplicial Nim

Simplicial Nim, introduced by Ehrenborg and Steingŕımsson, is a generalization of the classical two-player game of Nim. The heaps are placed on the vertices of a simplicial complex and a player’s move may affect any number of piles provided that the corresponding vertices form a face of the complex. In this paper, we present properties of a complex that are equivalent to the P-positions (winnin...

متن کامل

Wythoff Nim Extensions and Splitting Sequences

We study extensions of the classical impartial combinatorial game of Wythoff Nim. The games are played on two heaps of tokens, and have symmetric move options, so that, for any integers 0 ≤ x ≤ y, the outcome of the upper position (x, y) is identical to that of (y, x). First we prove that φ−1 = 2 1+ √ 5 is a lower bound for the lower asymptotic density of the x-coordinates of a given game’s upp...

متن کامل

Extensions and restrictions of Wythoff's game preserving its p positions

We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P positions. On the other hand, we characterize all moves that can be adjoined while preserving the original set of P positions. Testing if a move belongs to such an extended set of rules is shown to be doable in polynomial tim...

متن کامل

Modular Extensions to the ChEBI Ontology

ChEBI is an ontology of chemical entities of biological interest. It includes a structure-based and a role-based classification of chemical entities including molecules, ions and salts. This poster showcases recent developments and forthcoming enhancements to the ontology, focusing on modular extensions of the content. These extensions are being developed in support of error detection and consi...

متن کامل

# G 2 Integers 15 ( 2015 ) an Atlas of N - and P - Positions in ‘ Nim with a Pass ’

Perhaps the most famous combinatorial game is Nim, which was completely analyzed by C.L. Bouton in 1902. Since then, the game of Nim has been the subject of many research papers. In Guy and Nowakowski’s Unsolved Problems in Combinatorial Games, the following entry is found: “David Gale would like to see an analysis of Nim played with the option of a single pass by either of the players, which m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Game Theory

سال: 2016

ISSN: 0020-7276,1432-1270

DOI: 10.1007/s00182-016-0545-7